Properties of General Semantic Operators Determined by Logic-Based Systems

نویسندگان

  • Máire Lane
  • Anthony Karel Seda
چکیده

We discuss a very general semantic operator arising within logic-based programming systems from an algebraic point of view, and show how it connects four interesting aspects of computation: neural networks, conventional logic programming, constraint logic programming, and simple models of uncertainty in logic-based systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Executive Approach Based On the Production of Fuzzy Ontology Using the Semantic Web Rule Language Method (SWRL)

Today, the need to deal with ambiguous information in semantic web languages is increasing. Ontology is an important part of the W3C standards for the semantic web, used to define a conceptual standard vocabulary for the exchange of data between systems, the provision of reusable databases, and the facilitation of collaboration across multiple systems. However, classical ontology is not enough ...

متن کامل

Some Aspects of the Integration of Connectionist and Logic-Based Systems∗†

We discuss the computation by neural networks of semantic operators TP determined by propositional logic programs P over quite general many-valued logics T . We revisit and clarify the foundations of the relevant notions employed in approximating both TP and its fixed points when P is a first-order logic program.

متن کامل

Rough approximation operators based on quantale-valued fuzzy generalized neighborhood systems

Let $L$ be an integral and commutative quantale. In this paper, by fuzzifying the notion of generalized neighborhood systems, the notion of $L$-fuzzy generalized neighborhoodsystem is introduced and then a pair of lower and upperapproximation operators based on it are defined and discussed. It is proved that these approximation operators include generalized neighborhood system...

متن کامل

Foundations of Refinement Operators for Description Logics

In order to leverage techniques from Inductive Logic Programming for the learning in description logics (DLs), which are the foundation of ontology languages in the Semantic Web, it is important to acquire a thorough understanding of the theoretical potential and limitations of using refinement operators within the description logic paradigm. In this paper, we present a comprehensive study whic...

متن کامل

The spectral properties of differential operators with matrix coefficients on elliptic systems with boundary conditions

Let $$(Lv)(t)=sum^{n} _{i,j=1} (-1)^{j} d_{j} left( s^{2alpha}(t) b_{ij}(t) mu(t) d_{i}v(t)right),$$ be a non-selfadjoint differential operator on the Hilbert space $L_{2}(Omega)$ with Dirichlet-type boundary conditions. In continuing of papers [10-12], let the conditions made on the operator $ L$ be sufficiently more general than [11] and [12] as defined in Section $1$. In this paper, we estim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 225  شماره 

صفحات  -

تاریخ انتشار 2009